Centrum Voor Wiskunde En Informatica Reportrapport Waitfree Distributed Memory Management by Create, and Read until Deletion (crud) Waitfree Distributed Memory Management by Create, and Read until Deletion Crud

نویسندگان

  • W. H. Hesselink
  • J. F. Groote
  • Wim H. Hesselink
  • Jan Friso Groote
چکیده

The acronym CRUD represents an interface speci cation and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modi ed by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic counters for reference counting and consensus variables to ensure exclusive access. Performance is enhanced by using nondeterminacy guided by insecure knowledge. Experiments indicate that the algorithm is very suitable for multiprocessing. 1991 Mathematics Subject Classi cation: 68Q20, 68Q22 1991 Computing Reviews Classi cation System: D.m, D.2.4, E.1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waitfree Distributed Memory Management by Create, and Read until Deletion (crud) Waitfree Distributed Memory Management by Create, and Read until Deletion (crud)

The acronym CRUD represents an interface speciication and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modiied by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic ...

متن کامل

Waitfree Distributed Memory Management by Create, and Read until Deletion (crud)

The acronym CRUD represents an interface speciication and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modiied by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic ...

متن کامل

Computational Steering

Robert van Liere Centrum voor Wiskunde en Informatica P.O. Box 94079, 1090 GB Amsterdam The Netherlands E-mail: [email protected] Jurriaan D. Mulder Centrum voor Wiskunde en Informatica P.O. Box 94079, 1090 GB Amsterdam The Netherlands E-mail: [email protected] Jarke J. van Wijk Netherlands Energy Research Foundation ECN P.O. Box 1, 1755 ZG Petten The Netherlands Centrum voor Wiskunde en Informatica P...

متن کامل

Reducing Dynamic Feature Usage in PHP Code

Faculteit der Natuurwetenschappen, Wiskunde en Informatica Centrum voor Wiskunde en Informatica

متن کامل

Centrum Voor Wiskunde En Informatica Reportrapport More Examples in Manifold More Examples in Manifold

This document gives an additional insight into the use of the MANIFOLD system by presenting a set of non-trivial examples of programming using the MANIFOLD language. The development of these examples has been inspired by some general algorithmic patterns arising in the eld of computer graphics and the use of computing farms. The document presupposes that the reader is familiar with the syntax a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999